Partitioning Group by Cosets
Given a subgroup of a group , can be expressed as a disjoint union of cosets of in , either all left or all right cosets. By this theorem, these cosets are all of the same size.
This is clear to see from proving two related results (either of which would be sufficient).
Theorem
Given two left cosets of in , and , exactly one of the following is true:
That is, any two cosets are either equal or disjoint.
We are going to prove this by showing that:
That is, the first case is true if and only if the negation of the second is false (i.e. the second is true).
For the first implication, we will assume that , that is, there exists an element which is common to both cosets, or an such that:
It then follows from this that:
and likewise that .
Now we will show by showing inclusions both ways.
Let be arbitrary, that is
for some . However since ,
for some .
Substituting the second of these expressions into the first we have that , and hence . Since is chosen arbitrarily, . The reverse inclusion follows in the same way.
Corollary
for some cosets of in if and only if .
This follows simply from the fact that trivially, and hence at least contains . This means they are not disjoint, and hence .
Being an equivalence relation on this partitions into equivalence classes, which then correspond with the sets in the disjoint subset we use to express .
Symmetry
Let for . Then, , and hence there exists an such that .
Therefore , and since .
Transitivity
Let and . Hence there exists such that:
Now, , and since is closed under multiplication , hence .
Reflexivity
Since is a subgroup, , and hence for any , , thus .